Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers
نویسندگان
چکیده
منابع مشابه
Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers
0360-8352/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.cie.2008.09.004 q This manuscript was processed by Area Editor Ma * Corresponding author. Tel./fax: +52 653 5356168 E-mail address: [email protected] (V. Yaurima This paper presents a genetic algorithm for an important production scheduling problem. Since the problem is NP-hard, we focus on suboptimal scheduling solutions for the ...
متن کاملHybrid Flowshop with Unrelated Machines, Sequence Dependent Setup Time and Availability Constraints: An Enhanced Crossover Operator for a Genetic Algorithm
This paper presents a genetic algorithm for a scheduling problem frequent in printed circuit board manufacturing: a hybrid flowshop with unrelated machines, sequence dependent setup time and machine availability constraints. The proposed genetic algorithm is a modified version of previously proposed genetic algorithms for the same problem. Experimental results show the advantages of using new c...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملscheduling of unrelated parallel machines using two multi objective genetic algorithms with sequence-dependent setup times and precedent constraints
abstract: this paper considers the problem of scheduling n jobs on m unrelated parallel machines with sequence-dependent setup times. to better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. furthermore sequence-dependent setup times and anticipatory setups are included in the proposed model. the objective is ...
متن کاملMulti-objective Unrelated Parallel Machines Scheduling with Sequence-dependent Setup times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2009
ISSN: 0360-8352
DOI: 10.1016/j.cie.2008.09.004